A lower bound for tree resolution
نویسندگان
چکیده
منابع مشابه
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games
In this note we show that the asymmetric Prover-Delayer game developed in (ECCC, TR10–059) for Parameterized Resolution is also applicable to other treelike proof systems. In particular, we use this asymmetric Prover-Delayer to show a lower bound of the form 2Ω(n logn) for the pigeonhole principle in tree-like Resolution. This gives a new and simpler proof of the same lower bound established by...
متن کاملA Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer GamesI
In this note we show that the asymmetric Prover-Delayer game developed in [BGL10] for Parameterized Resolution is also applicable to other tree-like proof systems. In particular, we use this asymmetric Prover-Delayer game to show a lower bound of the form 2 logn) for the pigeonhole principle in tree-like Resolution. This gives a new and simpler proof of the same lower bound established by Iwama...
متن کاملA General Lower Bound for Collaborative Tree Exploration
We consider collaborative graph exploration with a set of k agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the ...
متن کاملConditional Lower Bound for Subgraph Isomorphism with a Tree Pattern
The kTree problem is a special case of Subgraph Isomorphism where the pattern graph is a tree, that is, the input is an n-node graph G and a k-node tree T , and the goal is to determine whether G has a subgraph isomorphic to T . We provide evidence that this problem cannot be computed significantly faster than 2poly(n), which matches the fastest algorithm known for this problem [ICALP 2009 and ...
متن کاملA Feasibly Constructive Lower Bound for Resolution Proofs
Haken [4] first proved the intractability of resolution by showing that a family of propositional formulas encoding the pigeon-hole principle require superpolynomial-sized resolution proofs. Later, several authors [6,1,2] extended Haken’s techniques to obtain exponential lower bounds on the size of resolution proofs. All of these results are based on the counting method used by Haken and later ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90132-5